Strongly Symmetric Equilibria in Bandit Games
نویسندگان
چکیده
This paper studies strongly symmetric equilibria (SSE) in continuous-time games of strategic experimentation with Poisson bandits. SSE payoffs can be studied via two functional equations similar to the HJB equation used for Markov equilibria. This is valuable for three reasons. First, these equations retain the tractability of Markov equilibrium, while allowing for punishments and rewards: the best and worst equilibrium payoff are explicitly solved for. Second, they capture behavior of the discrete-time game: as the period length goes to zero in the discretized game, the SSE payoff set converges to their solution. Third, they encompass a large payoff set: there is no perfect Bayesian equilibrium in the discrete-time game with frequent interactions with higher asymptotic efficiency.
منابع مشابه
Monotonic -equilibria in strongly symmetric games
-equilibrium allows for worse actions to be played with higher probability than better actions. I introduce a refinement that addresses this shortcoming: an -equilibrium is monotonic if each player assigns (weakly) higher probabilities to better actions. This concept is logically independent of strong -equilibrium. I study these refinements of -equilibrium in games with countably many players a...
متن کاملRobust Learning for Repeated Stochastic Games via Meta-Gaming
This paper addresses learning in repeated stochastic games (RSGs) played against unknown associates. Learning in RSGs is extremely challenging due to their inherently large strategy spaces. Furthermore, these games typically have multiple (often infinite) equilibria, making attempts to solve them via equilibrium analysis and rationality assumptions wholly insufficient. As such, previous learnin...
متن کاملOn Uniqueness and Stability of symmetric equilibria in differentiable symmetric games∗
Higher-dimensional symmetric games become of more and more importance for applied microand macroeconomic research. Standard approaches to uniqueness of equilibria have the drawback that they are restrictive or not easy to evaluate analytically. In this paper I provide some general but comparably simple tools to verify whether a symmetric game has a unique symmetric equilibrium or not. I disting...
متن کاملCapacitated Caching Games
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodeson a network making strategic choices regarding the content to replicate in their caches. Caching gameswere introduced by Chun et al [6], who analyzed the uncapacitated case leaving the capacitated version asan open direction.In this work, we study pure Nash equilibria of both frac...
متن کاملSymmetric games with only asymmetric equilibria
It is known that not every symmetric game has a symmetric equilibrium because there are examples of symmetric games that fail to have any equilibria at all. But this leads to the following question: If a symmetric game has a Nash equilibrium, does it have a symmetric Nash equilibrium? In this note, we show that the answer to this question is no by providing two examples of symmetric games that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014